-
1 quasilinear problem
Большой англо-русский и русско-английский словарь > quasilinear problem
-
2 quasilinear problem
Математика: квазилинейная задача -
3 quasilinear problem
мат. -
4 quasilinear
квазилинейный - quasilinear analysis - quasilinear approximation - quasilinear code - quasilinear coding - quasilinear entropy - quasilinear equation - quasilinear extrapolation - quasilinear operation - quasilinear operator - quasilinear problem - quasilinear representation - quasilinear space - quasilinear system - quasilinear theorБольшой англо-русский и русско-английский словарь > quasilinear
-
5 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
6 квазилинейная задача
Большой англо-русский и русско-английский словарь > квазилинейная задача
См. также в других словарях:
Classical central-force problem — In classical mechanics, the central force problem is to determine the motion of a particle under the influence of a single central force. A central force is a force that points from the particle directly towards (or directly away from) a fixed… … Wikipedia
Kepler problem — In classical mechanics, Kepler’s problem is a special case of the two body problem, in which the two bodies interact by a central force F that varies in strength as the inverse square of the distance r between them. The force may be either… … Wikipedia
Mechanism design — The Stanley Reiter diagram above illustrates a game of mechanism design. The upper left space Θ depicts the type space and the upper right space X the space of outcomes. The social choice function f(θ) maps a type profile to an outcome. In games… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Method of characteristics — In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first order equations, although more generally the method of characteristics is valid for any hyperbolic partial… … Wikipedia
Constraint counting — In mathematics, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a partial differential equation. Contents 1 Einstein strength 1.1 Linear equations 1.2 General solution… … Wikipedia
Кружков, Станислав Николаевич — Кружков Станислав Николаевич Дата рождения: 16 сентября 1936(1936 09 16) Место рождения: Москва Дата смерти: 12 июня 1997(1997 06 12) … Википедия
Кружков, Станислав — Кружков Станислав Николаевич Дата рождения: 16 сентября 1936 Место рождения: Москва Дата смерти: 12 июня 1997 Место смерти: Москва Станислав Николаевич Кр … Википедия
Кружков Станислав Николаевич — Дата рождения: 16 сентября 1936 Место рождения: Москва Дата смерти: 12 июня 1997 Место смерти: Москва Станислав Николаевич Кр … Википедия
Alternatives to general relativity — are physical theories that attempt to describe the phenomena of gravitation in competition to Einstein s theory of general relativity.There have been many different attempts at constructing an ideal theory of gravity. These attempts can be split… … Wikipedia
Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.[1] It is a second order method in time, implicit in time, and is numerically … Wikipedia